Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Improved traffic sign recognition algorithm based on YOLO v3 algorithm
JIANG Jinhong, BAO Shengli, SHI Wenxu, WEI Zhenkun
Journal of Computer Applications    2020, 40 (8): 2472-2478.   DOI: 10.11772/j.issn.1001-9081.2020010062
Abstract1054)      PDF (1310KB)(987)       Save
Concerning the problems of large number of parameters, poor real-time performance and low accuracy of traffic sign recognition algorithms based on deep learning, an improved traffic sign recognition algorithm based on YOLO v3 was proposed. First, the depthwise separable convolution was introduced into the feature extraction layer of YOLO v3, as a result, the convolution process was decomposed into depthwise convolution and pointwise convolution to separate intra-channel convolution and inter-channel convolution, thus greatly reducing the number of parameters and the calculation of the algorithm while ensuring a high accuracy. Second, the Mean Square Error (MSE) loss was replaced by the GIoU (Generalized Intersection over Union) loss, which quantified the evaluation criteria as a loss. As a result, the problems of MSE loss such as optimization inconsistency and scale sensitivity were solved. At the same time, the Focal loss was also added to the loss function to solve the problem of severe imbalance between positive and negative samples. By reducing the weight of simple background classes, the new algorithm was more likely to focus on detecting foreground classes. The results of applying the new algorithm to the traffic sign recognition task show that, on the TT100K (Tsinghua-Tencent 100K) dataset, the mean Average Precision (mAP) of the algorithm reaches 89%, which is 6.6 percentage points higher than that of the YOLO v3 algorithm; the number of parameters is only about 1/5 of the original YOLO v3 algorithm, and the Frames Per Second (FPS) is 60% higher than YOLO v3 algorithm. The proposed algorithm improves detection speed and accuracy while reducing the number of model parameters and calculation.
Reference | Related Articles | Metrics
Remote sensing image target detection and identification based on deep learning
SHI Wenxu, BAO Jiahui, YAO Yu
Journal of Computer Applications    2020, 40 (12): 3558-3562.   DOI: 10.11772/j.issn.1001-9081.2020040579
Abstract717)      PDF (1188KB)(1187)       Save
In order to improve the precision and speed of existing remote sensing image target detection algorithms in small-scale target detection, a remote sensing image target detection and identification algorithm based on deep learning was proposed. Firstly, a dataset of remote sensing images with different scales was constructed for model training and testing. Secondly, based on the original Single Shot multibox Detector (SSD) network model, the shallow feature fusion module, shallow feature enhancement module and deep feature enhancement module were designed and fused. Finally, the focal loss function was introduced into the training strategy to solve the problem of the imbalance of positive and negative samples in the training process, and the experiment was carried out on the remote sensing image dataset. Experimental results on high-resolution remote sensing image dataset show that the detection mean Average Precision (mAP) of the proposed algorithm achieves 77.95%, which is 3.99 percentage points higher than that of SSD network model, and has the detection speed of 33.8 frame/s. In the extended experiment, the performance of the proposed algorithm is better than that of SSD network model for the detection of fuzzy targets in high-resolution remote sensing images. Experimental results show that the proposed algorithm can effectively improve the precision of remote sensing image target detection.
Reference | Related Articles | Metrics
Greedy core acceleration dynamic programming algorithm for solving discounted {0-1} knapsack problem
SHI Wenxu, YANG Yang, BAO Shengli
Journal of Computer Applications    2019, 39 (7): 1912-1917.   DOI: 10.11772/j.issn.1001-9081.2018112393
Abstract669)      PDF (860KB)(367)       Save

As the existing dynamic programming algorithm cannot quickly solve Discounted {0-1} Knapsack Problem (D{0-1}KP), based on the idea of dynamic programming and combined with New Greedy Repair Optimization Algorithm (NGROA) and core algorithm, a Greedy Core Acceleration Dynamic Programming (GCADP) algorithm was proposed with the acceleration of the problem solving by reducing the problem scale. Firstly, the incomplete item was obtained based on the greedy solution of the problem by NGROA. Then, the radius and range of fuzzy core interval were found by calculation. Finally, Basic Dynamic Programming (BDP) algorithm was used to solve the items in the fuzzy core interval and the items in the same item set. The experimental results show that GCADP algorithm is suitable for solving D{0-1}KP. Meanwhile, the average solution speed of GCADP improves by 76.24% and 75.07% respectively compared with that of BDP algorithm and FirEGA (First Elitist reservation strategy Genetic Algorithm).

Reference | Related Articles | Metrics